home *** CD-ROM | disk | FTP | other *** search
/ Aminet 5 / Aminet 5 - March 1995.iso / Aminet / dev / misc / LEDA_gene.lha / LEDA-3.1c-generic / incl / LEDA / impl / rb_tree.h < prev    next >
Encoding:
C/C++ Source or Header  |  1994-08-05  |  1.4 KB  |  66 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  3.1c
  4. +
  5. +
  6. +  rb_tree.h
  7. +
  8. +
  9. +  Copyright (c) 1994  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16. #ifndef LEDA_RB_TREE_H
  17. #define LEDA_RB_TREE_H
  18.  
  19. //------------------------------------------------------------------------------
  20. //
  21. // rb_tree:  red black trees (leaf oriented & doubly linked)
  22. //
  23. //           derived from class "bin_tree"
  24. //
  25. // Ijon Tichy (1993)
  26. //
  27. //------------------------------------------------------------------------------
  28.  
  29.  
  30.  
  31. #include <LEDA/basic.h>
  32. #include <LEDA/impl/bin_tree.h>
  33.  
  34.  
  35. typedef bin_tree_node* rb_tree_item;
  36.  
  37.  
  38. // ----------------------------------------------------------------
  39. // class rb_tree
  40. // ----------------------------------------------------------------
  41.  
  42. class rb_tree : public virtual bin_tree
  43. { 
  44.   enum color  { red = 0, black = 1 };
  45.  
  46.   int root_balance() { return black; }
  47.   int node_balance() { return red; }
  48.   int leaf_balance() { return black; }
  49.  
  50.   void insert_rebal(rb_tree_item);
  51.   void del_rebal(rb_tree_item, rb_tree_item);
  52.  
  53. public:
  54.  
  55.   rb_tree() {}
  56.  ~rb_tree() {}
  57.  
  58.   rb_tree(const rb_tree& T) : bin_tree(T) {}
  59.  
  60.   rb_tree& operator=(const rb_tree& T) 
  61.   { bin_tree::operator=(T); return *this; }
  62.  
  63. };
  64.  
  65. #endif
  66.